翻訳と辞書 Words near each other ・ O'Sullivan Army Heliport ・ O'Sullivan Beach Football Club ・ O'Sullivan Beach, South Australia ・ O'Sullivan Beach-Lonsdale Football Club ・ O'Sullivan College ・ O'Sullivan Dam ・ O'Sullivan Ladies Open ・ O'Sullivan Peak ・ O'Sullivan v Noarlunga Meat Ltd ・ O'Sullivan v Noarlunga Meat Ltd (No 2) ・ O'Toole ・ O'Toole (surname) ・ O'Toole family ・ O'Toole Park ・ O'Tooles GAA ・ O(1) scheduler ・ O(n) ・ O(n) scheduler ・ O*-algebra ・ O+ Festival ・ O, Brazen Age ・ O, Capiz ・ O, ce veste minunată! ・ O, min Carl Gustaf ・ O, more, more! ・ O, My Darling Clementine ・ O, O, O... ・ O, Sport, You – the Peace! ・ O, The Oprah Magazine ・ O, Vrba Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク O(1) scheduler ： ウィキペディア英語版 O(1) scheduler An O(1) scheduler is a kernel scheduling design that can schedule processes within a constant amount of time, regardless of how many processes are running on the operating system. In Linux, it has replaced the previously used O(n) scheduler. One of the major goals of operating system designers is to minimize overhead and jitter of OS services, so that application programmers who use them endure less of a performance impact. O(1) scheduler providing "constant time" scheduling services has helped in this regard. In the realm of real-time operating systems, deterministic execution is key, and an O(1) scheduler is able to provide scheduling services with a fixed upper-bound on execution times. In versions of Linux kernel 2.6 prior to 2.6.23, the scheduler used is an O(1) scheduler by Ingo Molnár. The scheduler used thereafter is the Completely Fair Scheduler, also by Ingo Molnár, which runs in O(log N) time. == Overview == The Linux scheduler was overhauled completely with the release of kernel 2.6.〔(【引用サイトリンク】url = http://www.linuxjournal.com/magazine/completely-fair-scheduler )〕 This new scheduler is called the O(1) scheduler. The algorithm used by the O(1) scheduler relies on active and expired arrays of processes to achieve constant scheduling time. Each process is given a fixed time quantum, after which it is preempted and moved to the expired array. Once all the tasks from the active array have exhausted their time quantum and have been moved to the expired array, an array switch takes place. Because the arrays are accessed only via pointer, switching them is as fast as swapping two pointers.〔(【引用サイトリンク】url = http://www.informit.com/articles/article.aspx?p=101760&seqNum=2 )〕 This switch makes the active array the new empty expired array, while the expired array becomes the active array. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「O(1) scheduler」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.